Automatic mode inference for logic programs
نویسندگان
چکیده
منابع مشابه
Automatic Mode Inference for Logic Programs
In general, logic programs are undirected, i.e. there is no concept of ‘‘input’’ and ‘‘output’’ arguments to a procedure. An argument may be used either as an input or as an output argument, and programs may be executed either in a ‘‘forward’’ direction or in a ‘‘backward’’ direction. However, it is often the case that in a given program, a predicate is used with some of its arguments used cons...
متن کاملDeterminacy Inference for Logic Programs
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most one answer and that answer is generated only once. The principal component of the technique is a goalindependent analysis of individual clauses. This derives a condition for a call that ensures only one clause in the m...
متن کاملA descriptive Mode Inference for Logic
In general, an n-ary predicate (relation) describes the relationship among its arguments, and such that no argument has to be of a special mode. The uniication and the resolution (SLDNF-resolution) do capture this state of aaair. Hence, the aim of logic programming is in some point approximatively achieved if the system is able to automatically determine the descriptive mode of an n-ary predica...
متن کاملSlr Inference : an Inference Systemfor Fixed - Mode Logic Programs , Based on Slr
Deenite-clause grammars (DCGs) generalize context-free grammars in such a way that Prolog can be used as a parser in the presence of context-sensitive information. Prolog's proof procedure, however, is based on back-tracking, which may be a source of ineeciency. Parsers for context-free grammars which use backtracking, for instance, were soon replaced by more eecient methods such as LR parsers....
متن کاملSpeeding Up Inference for Probabilistic Logic Programs
Probabilistic Logic Programming (PLP) allows to represent domains containing many entities connected by uncertain relations and has many applications in particular in Machine Learning. PITA is a PLP algorithm for computing the probability of queries that exploits tabling, answer subsumption and Binary Decision Diagrams (BDDs). PITA does not impose any restriction on the programs. Other algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1988
ISSN: 0743-1066
DOI: 10.1016/0743-1066(88)90010-6